Local convergence of the Sato blind equalizer and generalizations under practical constraints

نویسندگان

  • Zhi Ding
  • Rodney A. Kennedy
  • Brian D. O. Anderson
  • C. Richard Johnson
چکیده

An early use of recursive identification in blind adaptive channel equalization is an algorithm developed by Sato. An important generalization of the Sat0 algorithm with extensive analysis appears in the work of Benveniste, Goursat, and Ruget. These generalized algorithms have been shown to possess a desirable global convergence property under two idealized conditions. The convergence properties of this class of blind algorithms under practical constraints common to a variety of channel equalization applications that violate these idealized conditions are studied. Results show that, in practice, when either the equalizer is finite-dimensional and/or the input is discrete (as in digital communications) the equalizer parameters may converge to parameter settings that fail to achieve the objective of approximating the channel inverse. It is also shown, that a center spike initialization is insufficient to guarantee avoiding such ill-convergence. Simulations verify the analytical results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Length- and cost-dependent local minima of unconstrained blind channel equalizers

Baud-rate linear blind equalizers may converge to undesirable stable equilibria due to different mechanisms. One such mechanism is the use of linear FIR filters as equalizers. In this paper, it is shown that this type of local minima exist for all unconstrained blind equalizers whose cost functions satisfy two general conditions. The local minima generated by this mechanism are thus called leng...

متن کامل

Ill-convergence of Godard blind equalizers in data communication systems

Godard algorithms form an important class of adaptive blind channel equalization algorithms for QAM transmission. In this paper, the existence of stable undesirable equilibria for the Godard algorithms is demonstrated through a simple AR channel model. These undesirable equilibria correspond to local but nonglobal minima of the underlying mean cost function, and thus permit the ill-convergence ...

متن کامل

Convergence and performance analysis of Godard family of blind equalization algorithms

We obtain the convergence of the Godard family (including SATO and CM algorithms) in a unified way. Our assumptions are quite realistic: the channel input can be asymptotically stationary and ergodic, the channel impulse response is finite and can be stationary, ergodic (this models fading channels) and the equalizer length is finite. The noise is i.i.d. The channel input can be discrete or con...

متن کامل

On the Convergence of Blind Channel Equalization

Baud-rate blind equalization algorithms may converge to undesirable stable equi-libria due to diierent reasons. One is the use of FIR lter as an equalizer. It is proved in this paper that this kind of local minima exist for all blind equalization algorithms. The local minima generated by this mechanism are thus called unavoidable local minima. The other one is due to the cost function adopted b...

متن کامل

Bussgang blind deconvolution for impulsive signals

Many blind deconvolution algorithms have been designed to extract digital communications signals corrupted by intersymbol interference (ISI). Such algorithms generally fail when applied to signals with impulsive characteristics, such as acoustic signals. While it is possible to stabilize such procedures in many cases by imposing unit-norm constraints on the adaptive equalizer coefficient vector...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1993